|
Language equations are mathematical statements that resemble numerical equations, but the variables assume values of formal languages rather than numbers. Instead of arithmetic operations in numerical equations, the variables are joined by language operations. Among the most common operations on two languages ''A'' and ''B'' are the set union ''A'' ∪ ''B'', the set intersection ''A'' ∩ ''B'', and the concatenation ''A''⋅''B''. Finally, as an operation taking a single operand, the set ''A'' * denotes the Kleene star of the language ''A''. Therefore language equations can be used to represent formal grammars, since the languages generated by the grammar must be the solution of a system of language equations. ==See also== * Boolean grammar * Arden's Rule * Set constraint 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「language equation」の詳細全文を読む スポンサード リンク
|